Continuous-Time Stochastic Games of Fixed Duration
نویسندگان
چکیده
منابع مشابه
Continuous-time stochastic games
We study continuous-time stochastic games (with finitely many states and actions), with a focus on the existence of their equilibria that are insensitive to a small imprecision in the specification of players’ evaluations of streams of payoffs. We show that the stationary, namely, time-independent, discounting game has a stationary equilibrium, that the (not necessarily stationary) discounting ...
متن کاملContinuous-Time Stochastic Games with Time-Bounded Reachability
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute εoptimal strategies in finite games and provide detailed complexity estimations. Moreover, we ...
متن کاملBlackwell-Nash Equilibrium for Discrete and Continuous Time Stochastic Games
We consider both discrete and continuous time finite state-action stochastic games. In discrete time stochastic games, it is known that a stationary BlackwellNash equilibrium (BNE) exists for a single controller additive reward (SC-AR) stochastic game which is a special case of a general stochastic game. We show that, in general, the additive reward condition is needed for the existence of a BN...
متن کاملStochastic Games with Short-Stage Duration
We introduce asymptotic analysis of stochastic games with shortstage duration. The play of stage k, k ≥ 0, of a stochastic game Γδ with stage duration δ is interpreted as the play in time kδ ≤ t < (k+ 1)δ, and therefore the average payoff of the n-stage play per unit of time is the sum of the payoffs in the first n stages divided by nδ, and the λ-discounted present value of a payoff g in stage ...
متن کاملFixed Point Solution to Stochastic Priority Games
We define and examine a class of two-player stochastic games that we call priority games. The priority games contain as proper subclasses the parity games studied in computer science [4] and the games with the limsup and liminf payoff mappings. We show that the value of the priority game can be expressed as an appropriate nested fixed point of the value mapping of the one-day game. This extends...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dynamic Games and Applications
سال: 2012
ISSN: 2153-0785,2153-0793
DOI: 10.1007/s13235-012-0067-2